Differential Chosen-Plaintext Cryptanalysis of an Improved Fast Encryption Algorithm for Multimedia (FEA-M)
نویسنده
چکیده
This paper studies the security of an improved fast encryption algorithm for multimedia (FEA-M). A simple differential chosen-plaintext attack is proposed to completely break the improved FEA-M. The proposed attack is very efficient in complexity and needs only two pairs of chosen plaintext blocks.
منابع مشابه
Further Improvements of Fast Encryption Algoirthm for Multimedia
In order to efficiently encrypt multimedia streams delivered in real-time environments, a Fast Encryption Algorithm for Multimedia (FEA-M) was proposed [8, 9]. Cryptanalyses of this technique [1, 3, 4, 5] have identified its weaknesses and an improved variant has been suggested in [5]. In this paper, we identify further weaknesses in the original FEA-M and also in the improved variant. Our solu...
متن کاملSecurity Problems with Improper Implementations of Improved FEA-M
This paper reports security problems with improper implementations of an improved version of FEA-M (fast encryption algorithm for multimedia). It is found that an implementation-dependent differential chosen-plaintext attack or its chosenciphertext counterpart can reveal the secret key of the cryptosystem, if the involved (pseudo-)random process can be tampered (for example, through a public ti...
متن کاملComments on the security of fast encryption algorithm for multimedia (FEA-M)
We show that the Fast Encryption Algorithm for Multimedia (FEA-w proposed by Yi et a1 is insecure. In particular, we present a simple attack that reduces the key to solving a set of linear equations. The low complexity of the attack combined with its simplicity makes it feasible in many multimedia applications. 11. FEA-M DESCRIPTION FEA-M encrypts 64 x 64 Boolean plaintext matrices using encryp...
متن کاملAn Efficient Known Plaintext Attack on FEA-M
Yi et al. have proposed a cipher called the fast encryption algorithm for multimedia (FEA-M). Recently Mihaljević and Kohno pointed out that FEA-M is insecure. However, their attacks are not efficient: their chosen plaintext attack and known plaintext attack require 2-bit chosen plaintext and 2-bit known plaintext, respectively. In this paper we give an efficient known plaintext attack against ...
متن کاملDifferential Cryptanalysis of Madryga
The Madryga encryption algorithm is susceptible to differential cryptanalysis. The key can be determined with about 5000 chosen plaintexts.
متن کامل